242 research outputs found
Perfect Sampling of the Master Equation for Gene Regulatory Networks
We present a Perfect Sampling algorithm that can be applied to the Master
Equation of Gene Regulatory Networks (GRNs). The method recasts Gillespie's
Stochastic Simulation Algorithm (SSA) in the light of Markov Chain Monte Carlo
methods and combines it with the Dominated Coupling From The Past (DCFTP)
algorithm to provide guaranteed sampling from the stationary distribution. We
show how the DCFTP-SSA can be generically applied to genetic networks with
feedback formed by the interconnection of linear enzymatic reactions and
nonlinear Monod- and Hill-type elements. We establish rigorous bounds on the
error and convergence of the DCFTP-SSA, as compared to the standard SSA,
through a set of increasingly complex examples. Once the building blocks for
GRNs have been introduced, the algorithm is applied to study properly averaged
dynamic properties of two experimentally relevant genetic networks: the toggle
switch, a two-dimensional bistable system, and the repressilator, a
six-dimensional genetic oscillator.Comment: Minor rewriting; final version to be published in Biophysical Journa
Pinned states in Josephson arrays: A general stability theorem
Using the lumped circuit equations, we derive a stability criterion for
superconducting pinned states in two-dimensional arrays of Josephson junctions.
The analysis neglects quantum, thermal, and inductive effects, but allows
disordered junctions, arbitrary network connectivity, and arbitrary spatial
patterns of applied magnetic flux and DC current injection. We prove that a
pinned state is linearly stable if and only if its corresponding stiffness
matrix is positive definite. This algebraic condition can be used to predict
the critical current and frustration at which depinning occurs.Comment: To appear in Phys. Rev.
On the stability of the Kuramoto model of coupled nonlinear oscillators
We provide an analysis of the classic Kuramoto model of coupled nonlinear
oscillators that goes beyond the existing results for all-to-all networks of
identical oscillators. Our work is applicable to oscillator networks of
arbitrary interconnection topology with uncertain natural frequencies. Using
tools from spectral graph theory and control theory, we prove that for
couplings above a critical value, the synchronized state is locally
asymptotically stable, resulting in convergence of all phase differences to a
constant value, both in the case of identical natural frequencies as well as
uncertain ones. We further explain the behavior of the system as the number of
oscillators grows to infinity.Comment: 8 Pages. An earlier version appeared in the proceedings of the
American Control Conference, Boston, MA, June 200
Finding role communities in directed networks using Role-Based Similarity, Markov Stability and the Relaxed Minimum Spanning Tree
We present a framework to cluster nodes in directed networks according to
their roles by combining Role-Based Similarity (RBS) and Markov Stability, two
techniques based on flows. First we compute the RBS matrix, which contains the
pairwise similarities between nodes according to the scaled number of in- and
out-directed paths of different lengths. The weighted RBS similarity matrix is
then transformed into an undirected similarity network using the Relaxed
Minimum-Spanning Tree (RMST) algorithm, which uses the geometric structure of
the RBS matrix to unblur the network, such that edges between nodes with high,
direct RBS are preserved. Finally, we partition the RMST similarity network
into role-communities of nodes at all scales using Markov Stability to find a
robust set of roles in the network. We showcase our framework through a
biological and a man-made network.Comment: 4 pages, 2 figure
Robustness of Random Graphs Based on Natural Connectivity
Recently, it has been proposed that the natural connectivity can be used to
efficiently characterise the robustness of complex networks. Natural
connectivity quantifies the redundancy of alternative routes in a network by
evaluating the weighted number of closed walks of all lengths and can be
regarded as the average eigenvalue obtained from the graph spectrum. In this
article, we explore the natural connectivity of random graphs both analytically
and numerically and show that it increases linearly with the average degree. By
comparing with regular ring lattices and random regular graphs, we show that
random graphs are more robust than random regular graphs; however, the
relationship between random graphs and regular ring lattices depends on the
average degree and graph size. We derive the critical graph size as a function
of the average degree, which can be predicted by our analytical results. When
the graph size is less than the critical value, random graphs are more robust
than regular ring lattices, whereas regular ring lattices are more robust than
random graphs when the graph size is greater than the critical value.Comment: 12 pages, 4 figure
Bounding stationary averages of polynomial diffusions via semidefinite programming
We introduce an algorithm based on semidefinite programming that yields
increasing (resp. decreasing) sequences of lower (resp. upper) bounds on
polynomial stationary averages of diffusions with polynomial drift vector and
diffusion coefficients. The bounds are obtained by optimising an objective,
determined by the stationary average of interest, over the set of real vectors
defined by certain linear equalities and semidefinite inequalities which are
satisfied by the moments of any stationary measure of the diffusion. We
exemplify the use of the approach through several applications: a Bayesian
inference problem; the computation of Lyapunov exponents of linear ordinary
differential equations perturbed by multiplicative white noise; and a
reliability problem from structural mechanics. Additionally, we prove that the
bounds converge to the infimum and supremum of the set of stationary averages
for certain SDEs associated with the computation of the Lyapunov exponents, and
we provide numerical evidence of convergence in more general settings
Approximations of countably-infinite linear programs over bounded measure spaces
We study a class of countably-infinite-dimensional linear programs (CILPs)
whose feasible sets are bounded subsets of appropriately defined weighted
spaces of measures. We show how to approximate the optimal value, optimal
points, and minimal points of these CILPs by solving finite-dimensional linear
programs. The errors of our approximations converge to zero as the size of the
finite-dimensional program approaches that of the original problem and are easy
to bound in practice. We discuss the use of our methods in the computation of
the stationary distributions, occupation measures, and exit distributions of
Markov~chains
- …